Multifrontal parallel distributed symmetric and unsymmetric solvers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unsymmetric-pattern Multifrontal Methods for Parallel Sparse Lu Factorization

Sparse matrix factorization algorithms are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method replace irregular operations with dense matrix kernels. However, no e cient method based primarily on dense matrix kernels exists for matrices whose pattern is very u...

متن کامل

Multifrontal solution of sparse unsymmetric matrices arising from semiconductor equations

The multifrontal LU method is implemented to solve drift-diffusion models with large sparse matrices arising in the simulation and optimization of semiconductor devices. The performance of this method is compared with the LU algorithm without multifrontal scheme on different computers in the case of a realistic double heterojunction transistor. Résumé On emploie un méthode LU multifrontale pour...

متن کامل

A CPU-GPU hybrid approach for the unsymmetric multifrontal method

Multifrontal is an efficient direct method for solving large-scale sparse and unsymmetric linear systems. The method transforms a large sparse matrix factorization process into a sequence of factorizations involving smaller dense frontal matrices. Some of these dense operations can be accelerated by using a graphic processing unit (GPU). We analyze the unsymmetricmultifrontalmethod fromboth an ...

متن کامل

An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization

Sparse matrix factorization algorithms for general problems are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method avoid indirect addressing in the innermost loops by using dense matrix kernels. However, no efficient LU factorization algorithm based primarily ...

متن کامل

MUltifrontal Massively Parallel Solver

This document describes the Fortran 90 and C user interfaces to MUMPS 4.10.0 We describe in detail the data structures, parameters, calling sequences, and error diagnostics. Basic example programs using MUMPS are also provided. ∗Information on how to obtain updated copies of MUMPS can be obtained from the Web pages http://mumps.enseeiht.fr/ and http://graal.ens-lyon.fr/MUMPS/

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering

سال: 2000

ISSN: 0045-7825

DOI: 10.1016/s0045-7825(99)00242-x